Rumour spreading on graphs
ثبت نشده
چکیده
How does gossip spread? How do technologies diffuse within or across societies? How do fads and fashions take hold? How do people learn about job opportunities or recruit workers? All these are examples of information spread over social networks, networks of friendship, family and acquaintance. They play a role in everything from the smooth functioning of economies to the maintenance of social and cultural groupings. Those are some of the questions that motivate our study of rumour/information spread in networks. Another motivation comes from synthetic networks like the Internet or peer-to-peer networks, where it may be important to disseminate information rapidly; for example, security updates or routing tables. Rumour spreading mechanisms provide a template for many distributed algorithms on such networks. In these lectures, we shall look at some highly simplified mathematical models of information spread, with the goal of addressing precise questions about the spped of spread. But first, we familiarise ourselves with some terminology.
منابع مشابه
Theory of Rumour Spreading in Complex Social Networks
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular, those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behaviour and dynamics of the model on several models of such networks: random graphs, uncorrela...
متن کاملRumors Spread Slowly in a Small-World Spatial Network
Rumour spreading is a protocol for modelling the spread of information through a network via user-to-user interaction. The Spatial Preferred Attachment (SPA) model is a random graph model for complex networks: vertices are placed in a metric space, and the link probability depends on the metric distance between vertices, and on their degree. We show that the SPA model typically produces graphs ...
متن کاملThe String of Diamonds Is Tight for Rumor Spreading
For a rumour spreading protocol, the spread time is defined as the first time that everyone learns the rumour. We compare the synchronous push&pull rumour spreading protocol with its asynchronous variant, and show that for any n-vertex graph and any starting vertex, the ratio between their expected spread times is bounded by O ( n1/3log n ) . This improves the O( √ n) upper bound of This work s...
متن کاملA process of rumour scotching on finite populations
Rumour spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumour is propagated by pairwise interactions between spreaders and ignorants. Only spreaders are active and may become stiflers after contacting spreaders or stiflers. Here we propose a competition-like model in which spreaders try to transmit an information, while stiflers ar...
متن کاملAsynchronous Rumour Spreading in Social and Signed Topologies
In this paper, we present an experimental analysis of the asynchronous push & pull rumour spreading protocol. This protocol is, to date, the best-performing rumour spreading protocol for simple, scalable, and robust information dissemination in distributed systems. We analyse the effect that multiple parameters have on the protocol’s performance, such as varying the rate at which nodes propagat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012